package com.ruijixiang.leetcode.hot100;

import java.util.HashMap;
import java.util.Map;

public class leetcode0001 {
    // 时间复杂度O(n)，空间复杂度O(n)
    public int[] twoSum(int[] nums,int target){
        Map<Integer,Integer> map=new HashMap<>();
        for(int i=0;i<nums.length;i++){
            if(map.containsKey(target-nums[i])){
                return new int[]{map.get(target-nums[i]),i};
            }
            map.put(nums[i],i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}
